Domination in partitioned graphs with minimum degree two
نویسندگان
چکیده
منابع مشابه
Total domination in partitioned trees and partitioned graphs with minimum degree two
Let G = (V,E) be a graph and let S ⊆ V . A set of vertices in G totally dominates S if every vertex in S is adjacent to some vertex of that set. The least number of vertices needed in G to totally dominate S is denoted by γt(G,S). When S = V , γt(G,V ) is the well studied total domination number γt(G). We wish to maximize the sum γt(G) + γt(G,V1) + γt(G,V2) over all possible partitions V1, V2 o...
متن کاملStratification and domination in graphs with minimum degree two
A graph G is 2-stratified if its vertex set is partitioned into two classes (each of which is a stratum or a color class). We color the vertices in one color class red and the other color class blue. Let F be a 2-stratified graph with one fixed blue vertex v specified. We say that F is rooted at v. The Fdomination number of a graphG is the minimum number of red vertices ofG in a red-blue colori...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملtwo-out degree equitable domination in graphs
an equitable domination has interesting application in the contextof social networks. in a network, nodes with nearly equal capacitymay interact with each other in a better way. in the societypersons with nearly equal status, tend to be friendly. in thispaper, we introduce new variant of equitable domination of agraph. basic properties and some interesting results have beenobtained.
متن کاملDomination in partitioned graphs
Let V1, V2 be a partition of the vertex set in a graph G, and let γi denote the least number of vertices needed in G to dominate Vi. We prove that γ1 + γ2 ≤ 45 |V (G)| for any graph without isolated vertices or edges, and that equality occurs precisely if G consists of disjoint 5-paths and edges between their centers. We also give upper and lower bounds on γ1 + γ2 for graphs with minimum valenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2007
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.07.024